A Meta-Heuristic Based on Genetic Algorithm for Selecting Bailiffs by Districts

This paper presents a proposal for solving the Problem of Selecting Bailiffs by Districts (PSB/D) in the central of warrants in Maranho-Brazil using Genetic Algorithm (GA). The complete solution to the PSB/D problem is a Web-based software called GAPSB/D. We conducted several experiments to prove its applicability considering two scenarios. The first scenario represents the central of warrants in the city of Imperatriz. The second one depicts the city of São Lúıs. The GA results are compared against two approaches: the manual selection currently in use and Simulated Annealing (SA). Results have proved GA could create solutions as good as the manual process, and it is more stable than SA, especially in the second scenario, in which the search space can reach a size of ≈ 10 possibilities of solutions.